Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Jose M. Framiñan
aka: José Manuel Framiñán Torres
University of Seville, School of Engineering, Spain
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 94 matches
- 2024
- Rebecca Fussone, Salvatore Cannella, Roberto Domínguez, Jose M. Framiñan:
Exploring symbiotic supply chains dynamics. Comput. Ind. Eng. 187: 109833 (2024) - Paz Perez-Gonzalez, Jose M. Framiñan:
A review and classification on distributed permutation flowshop scheduling problems. Eur. J. Oper. Res. 312(1): 1-21 (2024) - 2023
- Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas:
An overview on the use of operations research in additive manufacturing. Ann. Oper. Res. 322(1): 5-40 (2023) - Levi Ribeiro de Abreu, Bruno A. Prata, Marcelo Seido Nagano, Jose M. Framiñan:
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization. Comput. Oper. Res. 160: 106386 (2023) - Roberto Rosario Corsini, Antonio Costa, Salvatore Cannella, Jose M. Framiñan:
Analysing the impact of production control policies on the dynamics of a two-product supply chain with capacity constraints. Int. J. Prod. Res. 61(6): 1913-1937 (2023) - 2022
- Victor Fernandez-Viagas, Bruno de Athayde Prata, Jose M. Framiñan:
A critical-path based iterated local search for the green permutation flowshop problem. Comput. Ind. Eng. 169: 108276 (2022) - Levi Ribeiro de Abreu, Bruno A. Prata, Jose M. Framiñan, Marcelo Seido Nagano:
New efficient heuristics for scheduling open shops with makespan minimization. Comput. Oper. Res. 142: 105744 (2022) - Bruno de Athayde Prata, Victor Fernandez-Viagas, Jose M. Framiñan, Carlos Diego Rodrigues:
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput. Oper. Res. 145: 105880 (2022) - Victor Fernandez-Viagas, Carla Talens, Jose M. Framiñan:
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation. Eur. J. Oper. Res. 299(3): 869-882 (2022) - Bruno de Athayde Prata, Carlos Diego Rodrigues, José Manuel Framiñán Torres:
A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Syst. Appl. 189: 116097 (2022) - Antonio Costa, Salvatore Cannella, Roberto Rosario Corsini, Jose M. Framiñan, Sergio Fichera:
Exploring a two-product unreliable manufacturing system as a capacity constraint for a two-echelon supply chain dynamic problem. Int. J. Prod. Res. 60(3): 1105-1133 (2022) - Victor Fernandez-Viagas, Jose M. Framiñan:
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study. J. Ind. Inf. Integr. 27: 100281 (2022) - 2021
- Bruno de Athayde Prata, Carlos Diego Rodrigues, Jose M. Framiñan:
Customer order scheduling problem to minimize makespan with sequence-dependent setup times. Comput. Ind. Eng. 151: 106962 (2021) - Carla Talens, Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan:
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation. Comput. Ind. Eng. 158: 107364 (2021) - Salvatore Cannella, Borja Ponte, Roberto Domínguez, Jose M. Framiñan:
Proportional order-up-to policies for closed-loop supply chains: the dynamic effects of inventory controllers. Int. J. Prod. Res. 59(11): 3323-3337 (2021) - 2020
- Antonio Costa, Victor Fernandez-Viagas, Jose M. Framiñan:
Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput. Ind. Eng. 146: 106545 (2020) - Victor Fernandez-Viagas, Jose M. Framiñan:
Design of a testbed for hybrid flow shop scheduling with identical machines. Comput. Ind. Eng. 141: 106288 (2020) - Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan:
Permutation flowshop scheduling with periodic maintenance and makespan objective. Comput. Ind. Eng. 143: 106369 (2020) - Carla Talens, Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem. Comput. Ind. Eng. 140: 106223 (2020) - Levi Ribeiro de Abreu, Jesus O. Cunha, Bruno A. Prata, Jose M. Framiñan:
A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput. Oper. Res. 113 (2020) - Victor Fernandez-Viagas, Jose M. Molina-Pariente, Jose M. Framiñan:
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur. J. Oper. Res. 282(3): 858-872 (2020) - Victor Fernandez-Viagas, Antonio Costa, Jose M. Framiñan:
Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics. Expert Syst. Appl. 153: 113462 (2020) - 2019
- Jose M. Framiñan, Rainer Leisten:
Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms 12(12): 263 (2019) - Quan-Ke Pan, Liang Gao, Xinyu Li, Jose M. Framiñan:
Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl. Soft Comput. 81 (2019) - Roberto Domínguez, Borja Ponte, Salvatore Cannella, Jose M. Framiñan:
On the dynamics of closed-loop supply chains with capacity constraints. Comput. Ind. Eng. 128: 91-103 (2019) - Jose M. Framiñan, Victor Fernandez-Viagas, Paz Perez-Gonzalez:
Using real-time information to reschedule jobs in a flowshop with variable processing times. Comput. Ind. Eng. 129: 113-125 (2019) - Paz Perez-Gonzalez, Victor Fernandez-Viagas, Miguel Zamora García, Jose M. Framiñan:
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times. Comput. Ind. Eng. 131: 131-145 (2019) - Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Comput. Oper. Res. 109: 77-88 (2019) - Victor Fernandez-Viagas, Jose M. Framiñan:
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Comput. Oper. Res. 112 (2019) - Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas:
Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res. 273(2): 401-417 (2019)
skipping 64 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-18 17:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint